Approximating the maximum ergodic average via periodic orbits
نویسندگان
چکیده
منابع مشابه
Approximating Chaotic Time Series through Unstable Periodic Orbits
There are many noise reduction methods for chaotic signals, but most only work over a limited signal to noise range. If chaotic signals are to be used for communications, noise reduction techniques which can handle larger amounts of noise (or deterministic noise) are needed. I describe here a method of approximating a chaotic signal by constructing possible sequences based on unstable periodic ...
متن کاملPeriodic orbits of the Sitnikov problem via a Poincaré map
In this paper by means of a Poincaré map, we prove the existence of symmetric periodic orbits of the elliptic Sitnikov problem. Furthermore, using the presence of the Bernoulli shift as a subsystem of that Poincaré map, we prove that not all the periodic orbits of the Sitnikov problem are symmetric periodic orbits.
متن کاملApproximating the Maximum Sharing Problem
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first node layer of the graph, with the constraint that all paths have both endpoints in the second node layer and no node in that layer is covered more than once. MS is equivalent to the node-duplication based crossing elimination proble...
متن کاملReversible Relative Periodic Orbits
We study the bundle structure near reversible relative periodic orbits in reversible equivariant systems. In particular we show that the vector eld on the bundle forms a skew product system, by which the study of bifurcation from reversible relative periodic solutions reduces to the analysis of bifurcation from reversible discrete rotating waves. We also discuss possibilities for drifts along g...
متن کاملApproximating Average Parameters of Graphs
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average degree of a graph and the average distance between pairs of vertices in a graph. Since our focus is on sublinear algorithms, these algorithms access the input graph via queries to an adequate oracle. We consider two ty...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ergodic Theory and Dynamical Systems
سال: 2008
ISSN: 0143-3857,1469-4417
DOI: 10.1017/s014338570700082x